Subregion-Adaptive Integration of Functions Having a Dominant Peak 1
نویسندگان
چکیده
Many statistical multiple integration problems involve integrands that have a dominant peak. In applying numerical methods to solve these problems, statisticians have paid relatively little attention to existing quadrature methods and available software developed in the numerical analysis literature. One reason these methods have been largely overlooked, even though they are known to be more efficient than Monte Carlo for well-behaved problems of low dimensionality, may be that when applied naively they are poorly suited for peaked-integrand problems. In this paper we use transformations based on “split-t” distributions to allow the integrals to be efficiently computed using a subregion-adaptive numerical integration algorithm. Our split-t distributions are modifications of those suggested by Geweke (1989) and may also be used to define Monte Carlo importance functions. We then compare our approach to Monte Carlo. In the several examples we examine here, we find subregion-adaptive integration to be substantially more efficient than importance sampling.
منابع مشابه
Subregion-adaptive Integration of Functions Having a Dominant Peak
Many statistical multiple integration problems involve integrands that have a dominant peak. In applying numerical methods to solve these problems, statisticians have paid relatively little attention to existing quadrature methods and available software developed in the numerical analysis literature. One reason these methods have been largely overlooked, even though they are known to be more e ...
متن کاملMethods for Approximating Integrals in Statistics with Special Emphasis on Bayesian Integration Problems
This paper is a survey of the major techniques and approaches available for the numerical approximation of integrals in statistics. We classify these into ve broad categories; namely, asymptotic methods, importance sampling, adaptive importance sampling, multiple quadrature and Markov chain methods. Each method is discussed giving an outline of the basic supporting theory and particular feature...
متن کاملAn Adaptive Numerical Integration Algorithm for Simplices
A globally adaptive algorithm for numerical multiple integration over an n-dimensional simplex is described. The algorithm is based on a subdivision strategy that chooses for subdivision at each stage the subregion (of the input simplex) with the largest estimated error. This subregion is divided in half by bisecting an edge. The edge is chosen using information about the smoothness of the inte...
متن کاملTwo Methods for Load Balanced Distributed Adaptive Integration
Parallel subregion-adaptive integration often exhibits sequential behavior when applied to functions with diicult local problems such as boundary singularities. To correct this, one needs to balance the loads of the processors by providing all of them with a reasonably diicult part of the problem. In this paper, we present two distributed adaptive integration methods: one based on a global heap...
متن کاملDistributed Adaptive Integration: Algorithms and Analysis
We analyze a class of adaptive integration algorithms on MIMD distributed memory systems. The integration region subdivided in the course of the adaptive process is the N-dimensional cube or simplex. At the subdivision of a subregion, the error behaves according to a prescribed model. The model is supported by the asymptotic behavior of the error for integrands which are continuously diierentia...
متن کامل